Comparison of Two Structure-Exploiting Optimization Algorithms for Integral Quadratic Constraints
نویسندگان
چکیده
منابع مشابه
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
This manuscript develops a new framework to analyze and design iterative optimization algorithms built on the notion of Integral Quadratic Constraints (IQC) from robust control theory. IQCs provide sufficient conditions for the stability of complicated interconnected systems, and these conditions can be checked by semidefinite programming. We discuss how to adapt IQC theory to study optimizatio...
متن کاملOptimization algorithms exploiting unitary constraints
This paper presents novel algorithms that iteratively converge to a local minimum of a real-valued function ( ) subject to the constraint that the columns of the complex-valued matrix are mutually orthogonal and have unit norm. The algorithms are derived by reformulating the constrained optimization problem as an unconstrained one on a suitable manifold. This significantly reduces the dimension...
متن کاملIntegral Quadratic Constraints
Integral Quadratic Constraints (IQC) are inequalities used to describe (partially) possible signal combinations within a given dynamical system. IQC offer a framework for abstracting ”challenging” (e.g. non-linear, time-varying, uncertain, or distributed) elements of dynamical system models to aid in rigorous analysis of robust stability and performance (more specifically, to establish L2 gain ...
متن کاملApproximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are nonconvex in general, t...
متن کاملStrong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
We consider the problem of minimizing an indefinite quadratic function subject to two quadratic inequality constraints. When the problem is defined over the complex plane we show that strong duality holds and obtain necessary and sufficient optimality conditions. We then develop a connection between the image of the real and complex spaces under a quadratic mapping, which together with the resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2003
ISSN: 1474-6670
DOI: 10.1016/s1474-6670(17)35663-x